Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 1 of 442 results
Sort by: relevance publication year

On theta-palindromic richness

JOURNAL ARTICLE published March 2011 in Theoretical Computer Science

Research funded by Ministerstvo Školství, Mládeže a Tělovýchovy (SGS10/085OHK4/1T/14) | Grantová Agentura České Republiky (201/09/0584,LC06002,MSM6840770039)

Authors: Štěpán Starosta

https://doi.org/10.1016/j.tcs.2010.12.011 Actions

Palindromic richness for languages invariant under more symmetries

JOURNAL ARTICLE published January 2014 in Theoretical Computer Science

Research funded by Czech Science Foundation (GAČR 201/09/0584) | Grant Agency of the Czech Technical University in Prague (SGS11/162/OHK4/3T/14) | Czech Science Foundation (GAČR 13-03538S) | Czech Science Foundation (GAČR 13-35273P)

Authors: Edita Pelantová | Štěpán Starosta

https://doi.org/10.1016/j.tcs.2013.07.021 Actions

On the 2-binomial complexity of the generalized Thue–Morse words

JOURNAL ARTICLE published February 2024 in Theoretical Computer Science

Research funded by National Natural Science Foundation of China (12271175,12371086) | Guangzhou Municipal Science and Technology Program key projects (202102020294)

Authors: Xiao-Tao Lü | Jin Chen | Zhi-Xiong Wen | Wen Wu

https://doi.org/10.1016/j.tcs.2023.114342 Actions

On the critical exponent of generalized Thue-Morse words

JOURNAL ARTICLE published 1 January 2007 in Discrete Mathematics & Theoretical Computer Science

Authors: Alexandre B. Massé | Srečko Brlek | Amy Glen | Sébastien Labbé

https://doi.org/10.46298/dmtcs.397 Actions

Lyndon factorization of generalized words of Thue

JOURNAL ARTICLE published 1 January 2002 in Discrete Mathematics & Theoretical Computer Science

Authors: Anton Černý

https://doi.org/10.46298/dmtcs.296 Actions

On the abelian complexity of generalized Thue-Morse sequences

JOURNAL ARTICLE published August 2019 in Theoretical Computer Science

Research funded by NSFC (11701202,11431007,11871295)

Authors: Jin Chen | Zhi-Xiong Wen

https://doi.org/10.1016/j.tcs.2019.02.014 Actions

Monochromatic arithmetic progressions in binary Thue–Morse-like words

JOURNAL ARTICLE published October 2022 in Theoretical Computer Science

Research funded by Engineering and Physical Sciences Research Council (EP/S010335/1)

Authors: Ibai Aedo | Uwe Grimm | Yasushi Nagai | Petra Staynova

https://doi.org/10.1016/j.tcs.2022.08.013 Actions

Palindromic closures using multiple antimorphisms

JOURNAL ARTICLE published May 2014 in Theoretical Computer Science

Research funded by Project VEGA (1/0577/14) | Czech Science Foundation (GAČR 13-03538S) | Czech Science Foundation (GAČR 13-35273P)

Authors: Tatiana Jajcayová | Edita Pelantová | Štěpán Starosta

https://doi.org/10.1016/j.tcs.2014.03.020 Actions

Similarity density of the Thue-Morse word with overlap-free infinite binary words

JOURNAL ARTICLE published 21 May 2014 in Electronic Proceedings in Theoretical Computer Science

Authors: Chen Fei Du | Jeffrey Shallit

https://doi.org/10.4204/eptcs.151.16 Actions

On some generalizations of the Thue–Morse morphism

JOURNAL ARTICLE published January 2003 in Theoretical Computer Science

Authors: Patrice Séébold

https://doi.org/10.1016/s0304-3975(01)00228-6 Actions

Burrows–Wheeler transform and palindromic richness

JOURNAL ARTICLE published August 2009 in Theoretical Computer Science

Authors: Antonio Restivo | Giovanna Rosone

https://doi.org/10.1016/j.tcs.2009.03.008 Actions

On the 2-abelian complexity of the Thue–Morse word

JOURNAL ARTICLE published August 2015 in Theoretical Computer Science

Research funded by Austrian Science Fund (W1230,F5503)

Authors: Florian Greinecker

https://doi.org/10.1016/j.tcs.2015.05.047 Actions

On the subword complexity of Thue–Morse polynomial extractions

JOURNAL ARTICLE published December 2007 in Theoretical Computer Science

Authors: Yossi Moshe

https://doi.org/10.1016/j.tcs.2007.10.015 Actions

On the structure of Thue–Morse subwords, with an application to dynamical systems

JOURNAL ARTICLE published September 2014 in Theoretical Computer Science

Authors: Michel Dekking

https://doi.org/10.1016/j.tcs.2014.07.024 Actions

Palindromic factors of billiard words

JOURNAL ARTICLE published June 2005 in Theoretical Computer Science

Authors: J.-P. Borel | C. Reutenauer

https://doi.org/10.1016/j.tcs.2005.03.036 Actions

The Thue–Morse word contains circular 5/2+ power free words of every length

JOURNAL ARTICLE published February 2005 in Theoretical Computer Science

Authors: Ali Aberkane | James D. Currie

https://doi.org/10.1016/j.tcs.2004.12.024 Actions

Automaticity of the Hankel determinants of difference sequences of the Thue–Morse sequence

JOURNAL ARTICLE published October 2014 in Theoretical Computer Science

Research funded by NSFC (11071090,11371156)

Authors: Ying-Jun Guo | Zhi-Xiong Wen

https://doi.org/10.1016/j.tcs.2014.08.001 Actions

Lyndon factorization of the Thue-Morse word and its relatives

JOURNAL ARTICLE published 1 January 1997 in Discrete Mathematics & Theoretical Computer Science

Authors: Augustin Ido | Guy Melançon

https://doi.org/10.46298/dmtcs.233 Actions

Complexity and palindromic defect of infinite words

JOURNAL ARTICLE published February 2011 in Theoretical Computer Science

Authors: S. Brlek | C. Reutenauer

https://doi.org/10.1016/j.tcs.2010.11.025 Actions

Some combinatorial properties of the Thue–Morse sequence and a problem in semigroups

JOURNAL ARTICLE published March 1989 in Theoretical Computer Science

Authors: Aldo de Luca | Stefano Varricchio

https://doi.org/10.1016/0304-3975(89)90013-3 Actions
Feedback: support@crossref.org